A Genetic Algorithm Based Pattern Matcher

Pattern matching is the method of searching a pattern in a text. There are several existing algorithms which successfully locate the presence of a pattern in a text. In particular, Bioinfomaticians often search for a Deoxy-Ribo Nucleic Acid (DNA) pattern in a very long DNA sequence. These algorithms search the entire text in order to locate the pattern. Genetic algorithms, on the other hand, deal with search procedures that are based on natural selection. Nature selects those individuals that are, in comparison, healthier than others in a certain generation. Even though this method of natural selection relies on probability, the final result of the selection has generally led to better and healthier individuals. In this paper we have presented a scheme, which searches only certain portions of the text, determined by the genetic algorithm, where the probability of finding the pattern is the maximum.